Macromolecular electron density averaging on distributed memory MIMD systems

Adaptive Load Balancing Strategies for Solving Irregular Problems on Distributed Memory MIMD Systems

Modied Cyclic Algo- Rithms for Solving Triangular Systems on Distributed-memory Multiprocessors, Siam Complexity of Dense-linear-system Solution on a Multi- Processor Ring

We describe an e ort to implement the LINPACK Benchmark on two massively parallel distributed memory MIMD computers, the Intel iPSC/860 and DELTA Systems.

Direct Parallel Algorithms for Banded Linear Systems

We investigate direct algorithms to solve linear banded systems of equations on MIMD multiprocessor computers with distributed memory. We show that it is hard to beat ordinary one-processor Gaussian elimination. Numerical computation results from the Intel Paragon are given.

Application Driven MIMD Communication Processor Design

The design space of communication processors for message passing distributed memory systems is rather large. Many of the design decisions that are taken seem to be dependent on the targeted application, or application area, considering the various different communication hardware designs, commercial as well as research based, that have been presented. This paper describes a framework currently ...

The Genesis distributed memory benchmarks

The genesis distributed-memory benchmarks represent a signiicant step forward in the evaluation of distributed-memory MIMD systems. The initial version of this benchmark suite was augmented and modiied in order to evaluate the suprenum computer. This augmented suite has now been further modiied to allow the benchmarks to be run on several important distributed systems without further code modii...